Moduli dimensions of lattice polygons

نویسندگان

چکیده

Given a lattice polygon P with g interior points, we can associate to $$P$$ two moduli spaces: the space of algebraic curves that are non-degenerate respect and tropical genus Newton P. We completely classify possible dimensions such have in case. For non-hyperelliptic polygons, dimension must be between $$2g+1$$ take on any integer value this range, exceptions only cases 3, 4, 7. provide similar result for hyperelliptic which range is from $$2g-1$$ . In case our results also hold

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On convex lattice polygons

Let II be a convex lattice polygon with b boundary points and c (5 1) interior points. We show that for any given a , the number b satisfies b 5 2e + 7 , and identify the polygons for which equality holds. A lattice polygon II is a simple polygon whose vertices are points of the integral lattice. We let A = 4(11) denote the area of II , b{U) the number of lattice points on the boundary of II , ...

متن کامل

Convex Lattice Polygons

Let n ≥ 3 be an integer. A convex lattice n-gon is a polygon whose n vertices are points on the integer lattice Z 2 and whose interior angles are strictly less than π. Let a n denote the least possible area enclosed by a convex lattice n-gon, then [1, 2, 3] {a n } ∞ n=3 = n 1 2

متن کامل

Unfolding Lattice Polygons on Some Lattice Polyhedra∗

We consider the problem of unfolding lattice polygons embedded on the surface of some classes of lattice polyhedra. We show that an unknotted lattice polygon embedded on a lattice orthotube or orthotree can be convexified in O(n) moves and time, and a lattice polygon embedded on a lattice Tower of Hanoi or Manhattan Tower can be convexified in O(n) moves and time.

متن کامل

Lattice Polygons and the Number

In this note we classify all triples (a, b, i) such that there is a convex lattice polygon P with area a, and p respectively i lattice points on the boundary respectively in the interior. The crucial lemma for the classification is the necessity of b ≤ 2 i+7. We sketch three proofs of this fact: the original one by Scott [Sco76], an elementary one, and one using algebraic geometry. As a refinem...

متن کامل

Tiling Polygons with Lattice Triangles

Given a simple polygon with rational coordinates having one vertex at the origin and an adjacent vertex on the x-axis, we look at the problem of the location of the vertices for a tiling of the polygon using lattice triangles (i.e., triangles which are congruent to a triangle with the coordinates of the vertices being integer). We show that the coordinate of the vertices in any tiling are ratio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebraic Combinatorics

سال: 2021

ISSN: ['0925-9899', '1572-9192']

DOI: https://doi.org/10.1007/s10801-021-01062-6